Some combinatorial aspects of a counterfeit coin problem
نویسندگان
چکیده
Considered is the set-up of availability of n coins and the possibility of at the most one of these coins being counterfiet in the sense of possessing slightly more or slightly less weight than that of the rest, though all the coins have remarkably identical appearance ! There has been considerable interest in the underlying combinatorial problem of checking the existence of such a coin and identifying the same [in case it exists] in minimum number of efforts with an ordinary 2 pan balance. After quickly reviewing the literature, we propose to discuss some combinatorial aspects of this problem in situations wherein two or more 2-pan balances are made available to us.
منابع مشابه
Optimal non-adaptive solutions for the counterfeit coin problem
We give optimal solutions to all versions of the popular counterfeit coin problem obtained by varying whether (i) we know if the counterfeit coin is heavier or lighter than the genuine ones, (ii) we know if the counterfeit coin exists, (iii) we have access to additional genuine coins, and (iv) we need to determine if the counterfeit coin is heavier or lighter than the genuine ones. Moreover, ou...
متن کاملFinding Weighted Graphs by Combinatorial Search
We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let G be a weighted graph with n vertices. In the most general setting, the n vertices are known and no other information about G is given. The problem is finding all edges of G and their weights using additive queries, where, for an additive query, one chooses a set of vertices and asks the sum...
متن کاملAn Advanced Approach to Solve two Counterfeit Coins Problem
Though the counterfeit coin problem is well known as a fascinating puzzle it claims great importance in Computer science, Game theory, and Mathematics. In terms of the puzzle the objective is to detect the counterfeit coins which are identical in appearance but different in weight. The word counterfeit not only describes forgeries of currency or documents, but can also be applied to software, p...
متن کاملSolution to the Counterfeit Coin Problem and its Generalization
This work deals with a classic problem: ”Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and indicate whether it weighs less or more than the rest”. The method proposed here not only calculates the minimum number of weighings necessary, but also indicates ...
متن کاملSNIEDOVICH OR/MS Games: 3. Counterfeit Coin Problem OR/MS Games: 3. Counterfeit Coin Problem
In this discussion we examine two versions of the famous Counterfeit Coin Problem, focusing on their educational OR/MS content. It is shown that this problem provides an excellent environment for illustrating a number of fundamental OR/MS problem-solving concepts and methods related to decision making under uncertainty. A number of interactive modules are provided for experimentation with this ...
متن کامل